منابع مشابه
The Collatz 3n+1 Conjecture Is Unprovable
In this paper, we show that any proof of the Collatz 3n + 1 Conjecture must have an infinite number of lines. Therefore, no formal proof is possible. We also discuss whether the proof strategy in this paper has any promise for proving that the Riemann Hypothesis is also unprovable.
متن کاملω-rewriting the Collatz problem
The Collatz problem is comprised of two distinct, separate questions: existence of eventually periodic Collatz reductions with a nontrivial period, and existence of period-free Collatz reductions. This paper introduces a few distinct, related formalizations of the Collatz dynamics as term rewriting systems, using elementary concepts from the theory of state transition dynamics. Some of the subj...
متن کاملThe Collatz Problem and Analogues
In this paper, we study a polynomial analogue of the Collatz problem. Additionally, we show an additive property of the Collatz graph.
متن کاملThe Undecidability of the Generalized Collatz Problem
The Collatz problem, widely known as the 3x + 1 problem, asks whether or not a certain simple iterative process halts on all inputs. We build on earlier work by J. H. Conway, and show that a natural generalization of the Collatz problem is recursively undecidable.
متن کاملSome Natural Generalizations Of The Collatz Problem∗
We define here simple natural generalizations of Collatz Problem, stating some corresponding conjectures and showing some first interesting computations. We also address the conceptual importance of this kind of problems and the expected diffi culties into solving them. 1 Why Generalize an Apparently Intractable Problem? The Collatz Conjecture or 3x + 1 Conjecture, an elusive two-line algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1985
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(85)80020-0